On the microCHP scheduling problem
نویسندگان
چکیده
In this paper both continuous and discrete models for the microCHP (Combined Heat and Power) scheduling problem are derived. This problem consists of the decision making to plan runs for a specific type of distributed electricity generators, the microCHP. As a special result, one model variant of the problem, named n-DSHSP-restricted, is proven to be NPcomplete in the strong sense. This shows the necessity of the development of heuristics for the scheduling of microCHPs, in case multiple generators are combined in a so-called fleet.
منابع مشابه
Planning in smart grids
e electricity supply chain is changing, due to increasing awareness for sustainability and an improved energy eciency. e traditional infrastructure where demand is supplied by centralized generation is subject to a transition towards a Smart Grid. In this Smart Grid, sustainable generation from renewable sources is accompanied by controllable distributed generation, distributed storage and dem...
متن کاملScheduling Microchps in a Group of Houses
The increasing penetration of renewable energy sources, the demand for more energy efficient electricity production and the increase in distributed electricity generation causes a shift in the way electricity is produced and consumed. The downside of these changes in the electricity grid is that network stability and controllability becomes more difficult compared to the old situation. The new ...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملOptimality of the flexible job shop scheduling system based on Gravitational Search Algorithm
The Flexible Job Shop Scheduling Problem (FJSP) is one of the most general and difficult of all traditional scheduling problems. The Flexible Job Shop Problem (FJSP) is an extension of the classical job shop scheduling problem which allows an operation to be processed by any machine from a given set. The problem is to assign each operation to a machine and to order the operations on the machine...
متن کاملTrain Scheduling Problem with Consideration of Praying Constraint as an Application of Job Shop Scheduling Problem
The present paper extends the idea of job shop scheduling problem with resting constraints to the train scheduling problem with the Muslim praying considerations. For this purpose, after proposing the new mathematical model, a heuristic algorithm based on the Electromagnetism-Like algorithm (EM) which is well adjusted to scheduling problems is employed to solve the large-size practical cases. T...
متن کامل